A Space-Efficient Randomized DNA Algorithm for k-SAT
نویسندگان
چکیده
We present a randomized DNA algorithm for k-SAT based on the classical algorithm of Paturi et al. [8]. For an n-variable, m-clause instance of k-SAT (m > n), our algorithm finds a satisfying assignment, assuming one exists, with probability 1−e−α, in worst-case time O(kmn) and space O(2(1− 1 k ). This makes it the most space-efficient DNA k-SAT algorithm for k > 3 and k < n/ logα (i.e. the clause size is small compared to the number of variables). In addition, our algorithm is the first DNA algorithm to adapt techniques from the field of randomized classical algorithms.
منابع مشابه
A Space Efficient Randomized Dna Algorithm for K �
We present a randomized DNA algorithm for k SAT based on the classical algorithm of Paturi et al For an n variable m clause instance of k SAT m n our algorithm nds a satisfying assignment assuming one exists with probability e in worst case time O k mn and space O k n log This makes it the most space e cient DNA k SAT algo rithm for k and k n log i e the clause size is small compared to the num...
متن کاملExploiting Independent Subformulas: A Faster Approximation Scheme for #k-SAT
We present an improvement on Thurley’s recent randomized approximation scheme for #k-SAT where the task is to count the number of satisfying truth assignments of a Boolean function Φ given as an n-variable k-CNF. We introduce a novel way to identify independent substructures of Φ and can therefore reduce the size of the search space considerably. Our randomized algorithm works for any k. For #3...
متن کاملon Mathematical and Computing Sciences : TR - C 146 title : An Improved Randomized Algorithm for 3 - SAT author :
Schöning [Sch99] proposed a simple yet efficient randomized algorithm for solving the k-SAT problem. His analysis showed that for 3-SAT, finding a satisfying assignment of any satisfiable formula F with n variables can be achieved in poly(n) · (4/3) (= poly(n) · (1.3333)) expected time, which is optimal up to now. In this paper, we improve this expected time bound by using a combination of a de...
متن کاملComplexity and Algorithms for Well-Structured k-SAT Instances
This paper consists of two conceptually related but independent parts. In the first part we initiate the study of k-SAT instances of bounded diameter. The diameter of an ordered CNF formula is defined as the maximum difference between the index of the first and the last occurrence of a variable. We investigate the relation between the diameter of a formula and the tree-width and the path-width ...
متن کاملThe Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs
We provide some evidence that Unique k-SAT is as hard to solve as general k-SAT, where k-SAT denotes the satisfiability problem for k-CNFs with at most k literals in each clause and Unique k-SAT is the promise version where the given formula has 0 or 1 solutions. Namely, defining for each k > 1, sk = inf{δ > 0 | ∃ a O(2)-time randomized algorithm for k-SAT} and, similarly, σk = inf{δ > 0 | ∃ a ...
متن کامل